Meet and Join within the Lattice of Set Partitions
نویسنده
چکیده
We build on work of Boris Pittel [5] concerning the number of t-tuples of partitions whose meet (join) is the minimal (maximal) element in the lattice of set partitions.
منابع مشابه
ALGEBRAIC GENERATIONS OF SOME FUZZY POWERSET OPERATORS
In this paper, let $L$ be a completeresiduated lattice, and let {bf Set} denote the category of setsand mappings, $LF$-{bf Pos} denote the category of $LF$-posets and$LF$-monotone mappings, and $LF$-{bf CSLat}$(sqcup)$, $LF$-{bfCSLat}$(sqcap)$ denote the category of $LF$-completelattices and $LF$-join-preserving mappings and the category of$LF$-complete lattices and $LF$-meet-preserving mapping...
متن کاملWhere the Typical Set Partitions Meet and Join
The lattice of the set partitions of [n] ordered by refinement is studied. Suppose r partitions p1, . . . , pr are chosen independently and uniformly at random. The probability that the coarsest refinement of all pi ’s is the finest partition {1}, . . . , {n} is shown to approach 0 for r = 2, and 1 for r ≥ 3. The probability that the finest coarsening of all pi ’s is the one-block partition is ...
متن کاملOrbit Coherence in Permutation Groups
For G ≤ Sym(Ω), let π(G) be the set of partitions of Ω given by the cycles of elements of G. Under the refinement order, π(G) admits join and meet operations. We say thatG is joinor meet-coherent if π(G) is joinor meet-closed, respectively. The centralizer in Sym(Ω) of any permutation g is shown to be meetcoherent, and join-coherent subject to a finiteness condition. Hence if G is a centralizer...
متن کاملStirling number of the fourth kind and lucky partitions of a finite set
The concept of Lucky k-polynomials and in particular Lucky χ-polynomials was recently introduced. This paper introduces Stirling number of the fourth kind and Lucky partitions of a finite set in order to determine either the Lucky k- or Lucky χ-polynomial of a graph. The integer partitions influence Stirling partitions of the second kind.
متن کاملMinimally Intersecting Set Partitions of Type B
This paper is primarily concerned with the meet structure of the lattice of type Bn partitions of the set {±1, ±2, . . . , ±n}. The lattice of type Bn set partitions has been studied by Reiner [8]. It can be regarded as a representation of the intersection lattice of the type B Coxeter arrangements, see Björner and Wachs [3], Björner and Brenti [2] and Humphreys [6]. A set partition of type Bn ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Electr. J. Comb.
دوره 8 شماره
صفحات -
تاریخ انتشار 2001